Towards Distributed Algorithm Portfolios

نویسندگان

  • Matteo Gagliolo
  • Jürgen Schmidhuber
چکیده

In recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expected performances. In this paper, we extend our technique to the more interesting and practical case of multiple CPUs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Configuration of Sequential Planning Portfolios

Sequential planning portfolios exploit the complementary strengths of different planners. Similarly, automated algorithm configuration tools can customize parameterized planning algorithms for a given type of tasks. Although some work has been done towards combining portfolios and algorithm configuration, the problem of automatically generating a sequential planning portfolio from a parameteriz...

متن کامل

Value-at-Risk and expected shortfall for linear portfolios with elliptically distributed risk factors

In this paper, we generalize the parametric ∆-VaR method from portfolios with normally distributed risk factors to portfolios with elliptically distributed ones. We treat both the expected shortfall and the Value-at-Risk of such portfolios. Special attention is given to the particular case of a multivariate t-distribution.

متن کامل

Optimal Placement and Sizing of Multiple Renewable Distributed Generation Units Considering Load Variations Via Dragonfly Optimization Algorithm

The progression towards smart grids, integrating renewable energy resources, has increased the integration of distributed generators (DGs) into power distribution networks. However, several economic and technical challenges can result from the unsuitable incorporation of DGs in existing distribution networks. Therefore, optimal placement and sizing of DGs are of paramount importance to improve ...

متن کامل

Stock Portfolio Optimization Using Water Cycle Algorithm (Comparative Approach)

Portfolio selection process is a subject focused by many researchers. Various criteria involved in this process have undergone alterations over time, necessitating the use of appropriate investment decision support tools. An optimization approach used in different sciences is using meta-heuristic algorithms. In the present study, using Water Cycle Algorithm (WCA), a model was introduced for sel...

متن کامل

The use of the multi-cumulant tensor analysis for the algorithmic search for safe investment portfolios

The cumulant analysis plays an important role in non Gaussian distributed data analysis. The shares’ prices returns are good example of such data. The purpose of this research is to develop the cumulant based algorithm and use it to determine eigenvectors that represent investment portfolios with low variability. Such algorithm is based on the Alternating Least Square method and involves the si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008